41![Optimal Top-K Query Evaluation for Weighted Business Processes Daniel Deutch Tel Aviv University Tova Milo Optimal Top-K Query Evaluation for Weighted Business Processes Daniel Deutch Tel Aviv University Tova Milo](https://www.pdfsearch.io/img/b8e6595eff1e69fed9118463068b78dc.jpg) | Add to Reading ListSource URL: www.cs.tau.ac.ilLanguage: English - Date: 2010-09-20 08:07:02
|
---|
42![Exploring Unknown Environments with Obstacles Susanne Albers Klaus Kursawey Sven Schuiererz Exploring Unknown Environments with Obstacles Susanne Albers Klaus Kursawey Sven Schuiererz](https://www.pdfsearch.io/img/e2d8285b95405adf3390b97f71823f78.jpg) | Add to Reading ListSource URL: www14.in.tum.deLanguage: English - Date: 2013-11-25 11:05:22
|
---|
43![Algorithms for the Price of Optimum in Stackelberg Games (2006; Kaporis, Spirakis) Alexis C. Kaporis, Department of Computer Engineering and Informatics, University of Patras http://students.ceid.upatras.gr/˜kaporis Pau Algorithms for the Price of Optimum in Stackelberg Games (2006; Kaporis, Spirakis) Alexis C. Kaporis, Department of Computer Engineering and Informatics, University of Patras http://students.ceid.upatras.gr/˜kaporis Pau](https://www.pdfsearch.io/img/5913d72e6ce6d22fdbb07a549895a71f.jpg) | Add to Reading ListSource URL: students.ceid.upatras.grLanguage: English - Date: 2007-02-22 11:45:18
|
---|
44![Delta: Scalable Data Dissemination under Capacity ∗ Constraints Konstantinos Karanasos Asterios Katsifodimos Delta: Scalable Data Dissemination under Capacity ∗ Constraints Konstantinos Karanasos Asterios Katsifodimos](https://www.pdfsearch.io/img/57ea2f1a8d0d3e8e8c42f1982b47fa2d.jpg) | Add to Reading ListSource URL: www.user.tu-berlin.deLanguage: English - Date: 2016-07-21 07:25:50
|
---|
45![Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] † Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †](https://www.pdfsearch.io/img/df586e817b27f2cdee9efe9a162e00d7.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2015-05-29 10:12:12
|
---|
46![Optimal on-line colorings for minimizing the number of ADMs in optical networks⋆ Mordechai Shalom1,3 , Prudence W.H. Wong2 , and Shmuel Zaks1 ⋆⋆ Optimal on-line colorings for minimizing the number of ADMs in optical networks⋆ Mordechai Shalom1,3 , Prudence W.H. Wong2 , and Shmuel Zaks1 ⋆⋆](https://www.pdfsearch.io/img/eab5bce2f0319ee3d39182f4cdf3f04c.jpg) | Add to Reading ListSource URL: cgi.csc.liv.ac.ukLanguage: English - Date: 2009-02-24 10:13:31
|
---|
47![ISSN No: International Journal & Magazine of Engineering, Technology, Management and Research A Peer Reviewed Open Access International Journal ISSN No: International Journal & Magazine of Engineering, Technology, Management and Research A Peer Reviewed Open Access International Journal](https://www.pdfsearch.io/img/7983750a10ceec1b8612f15ceb2d73c5.jpg) | Add to Reading ListSource URL: www.ijmetmr.comLanguage: English - Date: 2015-01-27 07:14:54
|
---|
48![Subjective-Cost Policy Routing ⋆ Joan Feigenbaum a,1 a Yale University Computer Science Department, 51 Prospect St., New Haven, CT 06511, USA. Subjective-Cost Policy Routing ⋆ Joan Feigenbaum a,1 a Yale University Computer Science Department, 51 Prospect St., New Haven, CT 06511, USA.](https://www.pdfsearch.io/img/12a9dc2ab4b4103a1200aa85bce9f1e9.jpg) | Add to Reading ListSource URL: www.cs.yale.eduLanguage: English - Date: 2008-02-16 15:53:17
|
---|
49![ENC GNSSRotterdam guidance and navigation algorithms can be integrated in order to develop applications with particular requirements. Navigation of physicallychallenged people is one example where the database mu ENC GNSSRotterdam guidance and navigation algorithms can be integrated in order to develop applications with particular requirements. Navigation of physicallychallenged people is one example where the database mu](https://www.pdfsearch.io/img/aa065655b1c21bef157885bf9d57b2ff.jpg) | Add to Reading ListSource URL: quentin.ladetto.chLanguage: English - Date: 2007-02-12 05:28:23
|
---|
50![Tight Bounds for Delay-Sensitive Aggregation Yvonne Anne Oswald Stefan Schmid Roger Wattenhofer Tight Bounds for Delay-Sensitive Aggregation Yvonne Anne Oswald Stefan Schmid Roger Wattenhofer](https://www.pdfsearch.io/img/3e86953da75f5b4bc0933d0464403caa.jpg) | Add to Reading ListSource URL: disco.ethz.chLanguage: English - Date: 2014-09-26 08:36:31
|
---|